Computer Organization with Streaming Memory
نویسنده
چکیده
Disks and drums are not really random-access devices.. A new device is -proposed, combining each disk or drum track with integrated circuit or core memory buffers, which yields a sector-wide random-access 'LWindowU into the track contents. The sequential nature of the device is acknowledged in providing for a forced swapping algorithm. Three potential applications are described. In a small multiprogramming system, the buffers are addressed directly by the processor. Size-limited programs are stacked in vertical slices around the drum or disk. In a larger multiprogramming system, address mapping is included, bringing the system closer to conventional page-swapping
منابع مشابه
A Method to Reduce Effects of Packet Loss in Video Streaming Using Multiple Description Coding
Multiple description (MD) coding has evolved as a promising technique for promoting error resiliency of multimedia system in real-time application programs over error-prone communicational channels. Although multiple description lattice vector quantization (MDCLVQ) is an efficient method for transmitting reliable data in the context of potential error channels, this method doesn’t consider disc...
متن کاملA High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure
The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...
متن کاملA High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure
The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...
متن کاملA streaming algorithm for surface reconstruction
We present a streaming algorithm for reconstructing closed surfaces from large non-uniform point sets based on a geometric convection technique. Assuming that the sample points are organized into slices stacked along one coordinate axis, a triangle mesh can be efficiently reconstructed in a streamable layout with a controlled memory footprint. Our algorithm associates a streaming 3D Delaunay tr...
متن کاملStreaming scratchpad memory organization for video applications
To address the high data bus bandwidth requirements, the principle of locality of reference is exploited in the vast majority of video processing algorithms. Especially, for application’s kernels based on motion estimation, it is inevitable to fetch the pixel data from a local storage. However, the video application kernel requirements can vary significantly. The technique of data re-organizati...
متن کامل